//Thu Mar 25 18:45:50 CDT 2010
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>

using namespace std;

class TurretPlacement
{
public:
	long long count(vector<int> x, vector<int> y)
	{
		long long count = 0;
		for (int i = 0; i < (int) x.size(); i++)
		{
			for (int j = i + 1; j < (int) x.size(); j++)
			{
				int maxlen = (int) 2 * sqrt((x[i] - x[j]) * (x[i] - x[j])
						+ (y[i] - y[j]) * (y[i] - y[j]));
				for (int len = 1; len < maxlen; len++)
				{
					count += maxlen - len;
				}
			}
		}
		return count;
	}
};
/*
 * For any two of the points,
 * Use a as A's side length, use b as B's side length,
 * Then, 1 <= a/2 + b/2 <= the distance between centers of the towers.
 *
 * */
